The Consistency Properties of a Scalable, Concurrent Queue
نویسندگان
چکیده
This paper presents a concurrent FIFO queue. The queue is designed to support high, scalable performance through both partitioning its representation , and the removal of locks. A proof of the consistency properties of the queue operations is developed, based on the Linearizability consistency condition. Linearizability is of interest because of its compositional properties , providing a strong foundation for the construction of reliable concurrent systems. The FIFO queue is proven to be linearizable with high probability and is therefore termed-linearizable. This suprising result demonstrates the importance of verification in the implementation of reliable abstractions. The scalable throughput performance of the queue is demonstrated through a simulation study.
منابع مشابه
Scalable and Performance-Critical Data Structures for Multicores
In this work, we study the scalability, performance, design and implementation of basic data structure abstractions, such as a queue, for next generation multicore systems. We propose two algorithms for concurrent queue. Our first algorithm, a wait-free queue, provides an efficient replacement to a lock-free queue. Lock-free queue is considered very efficient, but does not provide local progres...
متن کاملConcurrent Sharing through Abstract Data - types : A Case Study
Conventionally, interaction in Parallel and Distributed systems is achieved through the use of either Message Passing or Shared Memory. This paper presents the case for an alternative mechanism supportinghigh-performance sharing in applications; Shared Abstract Data-types (SADTs). An example of the class of SADTs, a highly concurrent FIFO queue, is used to illustrate this approach. It is argued...
متن کاملThe Applicability, Concurrent Validity and Internal Consistency Reliability of the Persian Version of the National Institutes of Health Stroke Scale (NIHSS): Evidences for Gender Differences
Background: The National Institutes of Health Stroke Scale (NIHSS) can objectively quantify the severity of stroke. However no information is available about psychometric properties and it’s applicability in the Iranian population. Objectives: The present study purposed by utilization of this instrument for neurological deficits measurement due to stroke, to determine the internal cons...
متن کاملA Scalable Shared Queue on a Distributed Memory Machine
The emergence of low latency, high throughput routers means that network locality issues no longer dominate the performance of parallel algorithms. One of the key performance issues is now the even distribution of work across the machine, as the problem size and number of processors increase. This paper describes the implementation of a highly scalable shared queue, supporting the concurrent in...
متن کاملThe Contention Avoiding Concurrent Priority Queue
Efficient and scalable concurrent priority queues are crucial for the performance of many multicore applications, e.g. for task scheduling and the parallelization of various algorithms. Linearizable concurrent priority queues with traditional semantics suffer from an inherent sequential bottleneck in the head of the queue. This bottleneck is the motivation for some recently proposed priority qu...
متن کامل